Nuprl Lemma : adjacent_wf
11,40
postcript
pdf
T
:Type,
L
:(
T
List),
x
,
y
:
T
. adjacent(
T
;
L
;
x
;
y
)
latex
ProofTree
Definitions
Type
,
t
T
,
s
=
t
,
type
List
,
||
as
||
,
n
+
m
,
-
n
,
n
-
m
,
a
<
b
,
P
Q
,
False
,
A
,
P
&
Q
,
A
B
,
i
j
<
k
,
,
{
x
:
A
|
B
(
x
)}
,
{
i
..
j
}
,
x
:
A
B
(
x
)
,
Void
,
x
:
A
B
(
x
)
,
x
:
A
.
B
(
x
)
,
l
[
i
]
,
,
#$n
,
x
:
A
.
B
(
x
)
,
adjacent(
T
;
L
;
x
;
y
)
Lemmas
member
wf
,
int
seg
wf
,
length
wf1
,
select
wf
origin
T:Type, L:(T List), x, y:T. adjacent(T;L;x;y) 
T:Type, L:(T List), x, y:T. adjacent(T;L;x;y)
T
Q
A
B j < k
}
B(x)
B(x)x:A. B(x)
x:A. B(x)